Time-Dependence in Multi-Agent MDP Applied to Gate Assignment Problem
نویسندگان
چکیده
منابع مشابه
Time-Dependence in Multi-Agent MDP Applied to Gate Assignment Problem
Many disturbances can impact gate assignments in daily operations of an airport. Gate Assignment Problem (GAP) is the main task of an airport to ensure smooth flight-to-Gate assignment managing all disturbances. Or, flights schedule often undergoes some unplanned disruptions, such as weather conditions, gate availability or simply a delay that usually arises. A good plan to GAP should manage as...
متن کاملA multi-agent based optimization method applied to the quadratic assignment problem
Inspired by the idea of interacting intelligent agents of a multi-agent system, we introduce a multi-agent based optimization method applied to the quadratic assignment problem (MAOM-QAP). MAOM-QAP is composed of several agents (decision-maker agent, local search agents, crossover agents and perturbation agent) which are designed for the purpose of intensified and diversified search activities....
متن کاملApplication of multi-agent planning to the assignment problem
Nowadays, a globalization of national markets requires developing the flexible and demand-driven production systems with new innovative concepts of management, information processing, production scheduling and planning. The presented work focuses on the low-level planning, where the multi-agent solution towards a ‘‘job-machine’’ assignment is considered. The main point of the discussion is the ...
متن کاملAnt Colony Optimization applied to the Multi-Agent Patrolling Problem
Patrolling an environment involves a team of agents whose goal usually consists of continuously visiting its most relevant areas as frequently as possible. For such a task, agents have to coordinate their actions in order to achieve optimal performance. Current research that tackles this complex multi-agent problem usually de nes the environment as a graph, so that a wide range of applications ...
متن کاملThe over-constrained airport gate assignment problem
In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated 4ights and total walking distances or connection times. We 7rst use a greedy algorithm to minimize ungated 4ights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2018
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2018.090247